A lower bound for on-line ranking number of a path
نویسندگان
چکیده
منابع مشابه
A geometric lower bound on Grad's number
In this note we provide a new geometric lower bound on the so-called Grad's number of a domain Ω in terms of how far Ω is from being axisymmetric. Such an estimate is important in the study of the trend to equilibrium for the Boltzmann equation for dilute gases.
متن کاملa study on thermodynamic models for simulation of 1,3 butadiene purification columns
attempts have been made to study the thermodynamic behavior of 1,3 butadiene purification columns with the aim of retrofitting those columns to more energy efficient separation schemes. 1,3 butadiene is purified in two columns in series through being separated from methyl acetylene and 1,2 butadiene in the first and second column respectively. comparisons have been made among different therm...
The lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA lower bound on the independence number of a graph
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
متن کاملA Tight Lower Bound for On-line Monotonic List Labeling
Maintaining a monotonic labeling of an ordered list during the insertion of n items requires (nlog n) individual relabelings, in the worst case, if the number of usable labels is only polynomial in n. This follows from a lower bound for a new problem, preex bucketing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.072